Parallel computation of pseudospectra by fast descent q
نویسندگان
چکیده
The pseudospectrum descent method (PsDM) is proposed, a new parallel method for the computation of pseudospectra. The idea behind the method is to use points from an already existing pseudospectrum level curve oK to generate in parallel the points of a new level curve oKd such that d < . This process can be continued for several steps to approximate several pseudospectrum level curves lying inside the original curve. It is showed via theoretical analysis and experimental evidence that PsDM is embarrassingly parallel, like GRID, and that it adjusts to the geometric characteristics of the pseudospectrum; in particular it captures disconnected components. Results obtained on a parallel system using MPI validate the theoretical analysis and demonstrate interesting load-balancing issues. 2002 Elsevier Science B.V. All rights reserved.
منابع مشابه
Parallel computation of pseudospectra by fast descent
The pseudospectrum descent method (PsDM) is proposed, a new parallel method for the computation of pseudospectra. The idea behind the method is to use points from an already existing pseudospectrum level curve oK to generate in parallel the points of a new level curve oKd such that d < . This process can be continued for several steps to approximate several pseudospectrum level curves lying ins...
متن کاملComputation of Pseudospectra by Continuation
The concept of pseudospectrum was introduced by L. N. Trefethen to explain the behavior of nonnormal operators. Many phenomena (for example, hydrodynamic instability and convergence of iterative methods for linear systems) cannot be accounted for by eigenvalue analysis but are more understandable by examining the pseudospectra. The straightforward way to compute pseudospectra involves many appl...
متن کاملEfficient implementation of low time complexity and pipelined bit-parallel polynomial basis multiplier over binary finite fields
This paper presents two efficient implementations of fast and pipelined bit-parallel polynomial basis multipliers over GF (2m) by irreducible pentanomials and trinomials. The architecture of the first multiplier is based on a parallel and independent computation of powers of the polynomial variable. In the second structure only even powers of the polynomial variable are used. The par...
متن کاملFast Asynchronous Parallel Stochastic Gradient Decent
Stochastic gradient descent (SGD) and its variants have become more and more popular in machine learning due to their efficiency and effectiveness. To handle large-scale problems, researchers have recently proposed several parallel SGD methods for multicore systems. However, existing parallel SGD methods cannot achieve satisfactory performance in real applications. In this paper, we propose a f...
متن کاملProperties and computations of matrix pseudospectra
Pseudospectra were introduced as early as 1975 and became popular tool during the 1990s.In this paper, we give a new definition of pseudospectra by using QR decomposition. Some properties of pseduospectra are explored and an algorithm for the computation of pseduospectra is given.
متن کامل